Binary codes from reflexive uniform subset graphs on 3-sets

We examine the binary codes C2(Ai + I) from matrices Ai + I where Ai is an adjacency matrix of a uniform subset graph Γ(n, 3, i) of 3-subsets of a set of size n with adjacency defined by subsets meeting in i elements of Ω, where 0 ≤ i ≤ 2. Most of the main parameters are obtained; the hulls, the duals, and other subcodes of the C2(Ai + I) are also examined. We obtain partial PD-sets for some of the codes, for permutation decoding.